Minkowski sum

The Minkowski sum of two sets of position vectors $A$ and $B$ in Euclidean space is formed by adding each vector in $A$ to each vector in $B$ , i.e., the set

$A + B = a + b, |, a \in A, b \in B .$

Analogously, the Minkowski difference is defined as $A - B = a - b, |, a \in A, b \in B .$

Properties

For Minkowski addition, the zero set $0$ , containing only the zero vector $0$ , is an identity element: For every subset $S$ , of a vector space $S + 0 = S;$

The empty set is important in Minkowski addition, because the empty set annihilates every other subset: for every subset, $S$ , of a vector space, its sum with the empty set is empty: $S + \emptyset = \emptyset$ .

Minkowski addition behaves well with respect to the operation of taking convex hulls, as shown by the following proposition:

For all non-empty subsets $S_{1}$ and $S_{2}$ of a real vector-space, the convex hull of their Minkowski sum is the Minkowski sum of their convex hulls $Conv (S_{1} + S_{2}) = Conv (S_{1}) + Conv (S_{2}) .$

This result holds more generally for each finite collection of non-empty sets $Conv (Σ S_{n}) = Σ Conv (S_{n}) .$

If $S$ is a convex set then also $μ S + λ S$ is a convex set; furthermore $μ S + λ S = (μ + λ) S$ for every $μ, λ \geq 0$ . Conversely, if this "distributive property" holds for all non-negative real numbers, $μ, λ$ , then the set is convex.

Minkowski sums act linearly on the perimeter of two-dimensional convex bodies: the perimeter of the sum equals the sum of perimeters.

Algorithms for computing Minkowski sums

Planar case

Two convex polygons in the plane

For two convex polygons $P$ and $Q$ in the plane with $m$ and $n$ vertices, their Minkowski sum is a convex polygon with at most $m + n$ vertices and may be computed in time $O (m + n)$ by a very simple procedure, which may be informally described as follows. Assume that the edges of a polygon are given and the direction, say, counterclockwise, along the polygon boundary. Then it is easily seen that these edges of the convex polygon are ordered by polar angle. Let us merge the ordered sequences of the directed edges from $P$ and $Q$ into a single ordered sequence $S$ . Imagine that these edges are solid arrows which can be moved freely while keeping them parallel to their original direction. Assemble these arrows in the order of the sequence $S$ by attaching the tail of the next arrow to the head of the previous arrow. It turns out that the resulting polygonal chain will in fact be a convex polygon which is the Minkowski sum of $P$ and $Q$ .

Other

If one polygon is convex and another one is not, the complexity of their Minkowski sum is $O (n m)$ . If both of them are nonconvex, their Minkowski sum complexity is $O ((m n)^{2})$ .